Synchronous Hybrid Message-Adversary
نویسندگان
چکیده
The theory of distributed computing, lagging in its development behind practice, has been biased in its modelling by employing mechanisms within the model mimicking reality. Reality means, processors can fail. But theory is about predicting consequences of reality, hence if we capture reality by “artificial models,” but those nevertheless make analysis simpler, we should pursue the artificial models. Recently the idea was advocated to analyze distributed systems and view processors as infallible. It is the message delivery substrate that causes problems. This view not only can effectively emulate reality, but above all seems to allow to view any past models as synchronous models. Synchronous models are easier to analyze than asynchronous ones. Furthermore, it gives rise to models we haven’t contemplated in the past. One such model, presented here, is the Hybrid Message-Adversary. We motivate this model through the need to analyze Byzantine faults. The Hybrid model exhibits a phenomenon not seen in the past. ∗Email: [email protected]. †Email: [email protected]. ar X iv :1 60 5. 02 27 9v 1 [ cs .D C ] 8 M ay 2 01 6
منابع مشابه
Round-based Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors
A message adversary is a daemon that suppresses messages in round-based message-passing synchronous systems in which no process crashes. A property imposed on a message adversary defines a subset of messages that cannot be eliminated by the adversary. It has recently been shown that when a message adversary is constrained by a property denoted TOUR (for tournament), the corresponding synchronou...
متن کاملThe Wakeup Problem in Synchronous Broadcast
This paper studies the differences between two levels of synchronization in a distributed broadcast system (or a multiple-access channel). In the globally synchronous model, all processors have access to a global clock. In the locally synchronous model, processors have local clocks ticking at the same rate, but each clock starts individually when the processor wakes up. We consider the fundamen...
متن کاملThe Wakeup Problem in Synchronous Broadcast Systems
This paper studies the di erences between two levels of synchronization in a distributed broadcast system (or a multiple access channel). In the globally synchronous model, all processors have access to a global clock. In the locally synchronous model, processors have local clocks ticking at the same rate, but each clock starts individually, when the processor wakes up. We consider the fundamen...
متن کاملMinimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks
In this paper we give the minimal connectivity required in a synchronous directed network, which is under the influence of a computationally unbounded Byzantine adversary that can corrupt a subset of nodes, so that Secure Message Transmission is possible between sender S and receiver R. We also show that secure communication between a pair of nodes in a given synchronous directed network is pos...
متن کاملProbabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality
In this paper, we study the problem of probabilistic perfectly reliable message transmission (PPRMT) and probabilistic perfectly secure message transmission (PPSMT) between a sender S and a receiver R in a synchronous network, where S and R are connected by n vertex disjoint paths called wires. Some of these n wires may be corrupted by a mixed adversary (tb, to, tf , tp), having unbounded compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1605.02279 شماره
صفحات -
تاریخ انتشار 2016